ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
نویسنده
چکیده
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is solved rapidly using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside graph drawing too.
منابع مشابه
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. T...
متن کاملDrawing Huge Graphs by Algebraic Multigrid Optimization
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; using a serial PC, it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimi...
متن کاملA Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise...
متن کاملMultiscale computation: from fast solvers to systematic upscaling
Most fundamental problems in physics, chemistry and engineering involve computation too hard even for future supercomputers, if conventional mathematical approaches are used. The reason is always a product of several complexity factors associated with the wide range of space and time scales characteristic to such problems. Each of these complexity factors can in principle be removed by various ...
متن کاملFast Layout Methods for Timetable Graphs
In this paper, we present a fast layout algorithm using an entirely different approa h to edge routing, based on dire tions of ontrol segments rather than positions of ontrol points. We reveal an interesting theoreti al onne tion with Tutte's bary entri layout method [18℄, and our omputational studies show that this new approa h yields satisfa tory layouts even for huge timetable graphs within ...
متن کامل